Properties of Pattern Matrices With Applications to Structured Systems

نویسندگان

چکیده

In cases where we do not have the exact parameter values of a mathematical model, often at least some structural information, e.g., that parameters are nonzero. Such information can be captured by so-called pattern matrices, whose symbolic entries used to represent available about corresponding parameters. this letter, focus on matrices with three types entries: those zero, nonzero, and arbitrary We formally define study addition multiplication such matrices. The results then in algebraic characterization strong properties. particular, provide sufficient conditions for controllability linear descriptor systems, necessary input-state observability, output systems.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Sign properties of Metzler matrices with applications

Several results about sign properties of Metzler matrices are obtained. It is first established that checking the sign-stability of a Metzler sign-matrix can be either characterized in terms of the Hurwitz stability of the unit sign-matrix in the corresponding qualitative class, or in terms the negativity of the diagonal elements of the Metzler sign-matrix and the acyclicity of the associated d...

متن کامل

Factoring matrices with a tree-structured sparsity pattern

Article history: Received 12 May 2010 Accepted 15 March 2011 Available online xxxx Submitted by V. Mehrmann AMS classification: 65F50 65F05 15A23

متن کامل

Rank structured matrices: theory, algorithms and applications

In numerical linear algebra much attention has been paid to matrices that are sparse, i.e., containing a lot of zeros. For example, to compute the eigenvalues of a general dense symmetric matrix, this matrix is first reduced to a similar tridiagonal one using an orthogonal similarity transformation. The subsequent QR-algorithm performed on this n×n tridiagonal matrix, takes the sparse structure...

متن کامل

The probability of primeness for specially structured polynomial matrices over finite fields with applications to linear systems and convolutional codes

We calculate the probability that random polynomial matrices over a finite field with certain structures are right prime or left prime, respectively. In particular, we give an asymptotic formula for the probability that finitely many nonsingular polynomial matrices are mutually left coprime. These results are used to estimate the number of reachable and observable linear systems as well as the ...

متن کامل

Properties of matrices with numerical ranges in a sector

Let $(A)$ be a complex $(ntimes n)$ matrix and assume that the numerical range of $(A)$ lies in the set of a sector of half angle $(alpha)$ denoted by $(S_{alpha})$. We prove the numerical ranges of the conjugate, inverse and Schur complement of any order of $(A)$ are in the same $(S_{alpha})$.The eigenvalues of some kinds of matrix product and numerical ranges of hadmard product, star-congruen...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE Control Systems Letters

سال: 2022

ISSN: ['2475-1456']

DOI: https://doi.org/10.1109/lcsys.2021.3050709